منابع مشابه
Counting Markov Blanket Structures
Learning Markov blanket (MB) structures has proven useful in performing feature selection, learning Bayesian networks (BNs), and discovering causal relationships. We present a formula for efficiently determining the number of MB structures given a target variable and a set of other variables. As expected, the number of MB structures grows exponentially. However, we show quantitatively that ther...
متن کاملEstimating Markov model structures
We investigate the derivation of Markov model structures from text corpora. The structure of a Markov model is its number of states plus the set of outputs and transitions with non-zero probability. The domain of the investigated models is part-of-speech tagging. Our investigations concern two methods to derive Markov models and their structures. Both are able to form categories and allow words...
متن کاملMarkov chain Monte Carlo over Model Structures
Introduction MCMCMS implements a generic framework for constructing Markov chains. It can be used to perform statistical machine learning in a Bayesian framework. It presents a modular, high level approach to performing MCMC simulations over statistical models that can explain observed data [1]. The two main benefits of MCMCMS are its prior-centric construction of the chain, that does away with...
متن کاملHidden Markov structures for dynamic copulae ∗
Understanding the dynamics of a high dimensional non-normal dependency structure is a challenging task. A multivariate Gaussian or mixed normal time varying models are limited in capturing important types of data features such as heavy tails, asymmetry, and nonlinear dependencies. This research aims at tackling this problem by building up a hidden Markov model (HMM) for hierarchical Archimedean...
متن کاملReversible Markov structures on divisible set partitions
We study k-divisible partition structures, which are families of random set partitions whose block sizes are divisible by an integer k = 1, 2, . . .. In this setting, exchangeability corresponds to the usual invariance under relabeling by arbitrary permutations; however, for k > 1, the ordinary deletion maps on partitions no longer preserve divisibility, and so a random deletion procedure is ne...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the American Mathematical Society
سال: 1977
ISSN: 0002-9904
DOI: 10.1090/s0002-9904-1977-14374-7